Computing Minimum Area Homologies

نویسندگان

  • Erin W. Chambers
  • Mikael Vejdemo-Johansson
چکیده

Calculating and categorizing the similarity of curves is a fundamental problem which has generated much recent interest. However, to date there are no implementations of these algorithms for curves on surfaces with provable guarantees on the quality of the measure. In this paper, we present a similarity measure for any two cycles that are homologous, where we calculate the minimum area of any homology (or connected bounding chain) between the two cycles. The minimum area homology exists for broader classes of cycles than previous measures which are based on homotopy. It is also much easier to compute than previously defined measures, yielding an efficient implementation that is based on linear algebra tools. We demonstrate our algorithm on a range of inputs, showing examples which highlight the feasibility of this similarity measure.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing of the Burnt Forest Regions Area Using Digital Image Processing

At present, there is no conventional scientific method to evaluate the area of the burnt regions of forests and in this field, the related organizations use different methods and variables. Also, the speed in performing the processes of area computing and damage evaluation, especially in the extensive damaged forest regions is very slow; consequently, the expression of results takes more ti...

متن کامل

Computing of the Burnt Forest Regions Area Using Digital Image Processing

At present, there is no conventional scientific method to evaluate the area of the burnt regions of forests and in this field, the related organizations use different methods and variables. Also, the speed in performing the processes of area computing and damage evaluation, especially in the extensive damaged forest regions is very slow; consequently, the expression of results takes more ti...

متن کامل

OMG! Orthologs in Multiple Genomes - Competing Graph-Theoretical Formulations

From the set of all pairwise homologies, weighted by sequence similarities, among a set of genomes, we seek disjoint orthology sets of genes, in which each element is orthogonal to all other genes (on a different genome) in the same set. In a graph-theoretical formulation, where genes are vertices and weighted edges represent homologies, we suggest three criteria, with three different biologica...

متن کامل

Minimum Area All-flush Triangles Circumscribing a Convex Polygon

In this paper, we consider the problem of computing the minimum area triangle that circumscribes a given n-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of n half-planes defined by a given convex polygon. Previously, O(n logn) time algorithms were known which are based on the technique for computing...

متن کامل

Computing the Center of Area of a Convex Polygon∗

The center of area of a convex planar set is the point for which the minimum area of intersected by any halfplane containing is maximized. We describe a simple randomized linear-time algorithm for computing the center of area of a convex -gon.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Comput. Graph. Forum

دوره 34  شماره 

صفحات  -

تاریخ انتشار 2015